A Comparison of Disjunctive Well-founded Semantics

نویسندگان

  • Matthias Knorr
  • Pascal Hitzler
چکیده

While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. This is mainly caused by the completely different mechanisms applied in the approaches. In order to aid the quest for suitable disjunctive well-founded semantics, we present a systematic approach to a comparison based on level mappings, a recently introduced framework for characterizing logic programming semantics, which was quite successfully used for comparing the major semantics for normal logic programs. We extend this framework to disjunctive logic programs and present alternative characterizations for the strong well-founded semantics (SWFS), the generalized disjunctive wellfounded semantics (GDWFS), and the disjunctive well-founded semantics (D-WFS). This will allow us to gain comparative insights into their different handling of negation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Disjunctive Well-founded Semantics

While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order ...

متن کامل

A Comparison of the Static andthe Disjunctive Well -

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive De-ductive Databases. While the semantics of non-disjunctive programs is fairly well understood the declarative and computational foundations of disjunctive programming proved to be much more elusive and diicult. Quite recently, two new and very promising semantics have b...

متن کامل

A Comparative Study of Disjunctive Well-Founded Semantics

A lot of different proposals were made claiming to extend the wellfounded semantics to logic programs with disjunction. None of these however has been established as ’the’ disjunctive well-founded semantics which is mainly caused by the different intuitive ideas on which these semantics are based. In fact, some of them are even incomparable with respect to their derivable knowledge, and systema...

متن کامل

Static Semantics as Program Transformation and Well-founded Computation

In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal programs. Based on considerations about how disjunctive information is treated by a given semantics, we divide the computation of that semantics into two phases. The first one is a program transformation phase, which applie...

متن کامل

An Alternating Well-Founded Semantics for Query Answering in Disjunctive Databases

The well{founded semantics has been introduced for normal databases (i.e. databases that may have default negation in their rule bodies, but do not have disjunctions). In this paper we propose an extension of the well{founded semantics to the disjunctive case. For this purpose we investigate the alternating xpoint approach of Van Gelder, Ross and Schlipf 16], and develop a suitable generalizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007